منابع مشابه
The Excessive [3]-Index of All Graphs
Let m be a positive integer and let G be a graph. A set M of matchings of G, all of which of size m, is called an [m]-covering of G if ⋃ M∈MM = E(G). G is called [m]-coverable if it has an [m]-covering. An [m]-covering M such that |M| is minimum is called an excessive [m]-factorization of G and the number of matchings it contains is a graph parameter called excessive [m]-index and denoted by χ[...
متن کاملOn Certain Properties of Random Apollonian Networks
In this work we analyze fundamental properties of Random Apollonian Networks [34,35], a popular random graph model which generates planar graphs with power law properties. Specifically, we analyze (a) the degree distribution, (b) the k largest degrees, (c) the k largest eigenvalues and (d) the diameter, where k is a constant.
متن کاملOn the Wiener index of trees from certain families
The Wiener index W( G) of a connected graph G is the sum of the distances d( u, v) between all pairs of vertices u and v of G. This index seems to have been introduced in [22] where it was shown that certain physical properties of various paraffin species are correlated with the Wiener index of the tree determined by the carbon atoms of the corresponding molecules. Canfield, Robinson, and Rouvr...
متن کاملEstimation of coal swelling index based on chemical properties of coal using artificial neural networks
Free swelling index (FSI) is an important parameter for cokeability and combustion of coals. In this research, the effects of chemical properties of coals on the coal free swelling index were studied by artificial neural network methods. The artificial neural networks (ANNs) method was used for 200 datasets to estimate the free swelling index value. In this investigation, ten input parameters ...
متن کاملextensions, minimality and idempotents of certain semigroup compactifications
در فصل اول مقدمات و پیش نیازهای لازم برای فصل های بعدی فراهم گردیده است . در فصل دوم مساله توسیع مورد توجه قرار گرفته و ابتدا شرایطی که تحت آن از یک فشرده سازی نیم گروهی خاص یک زیرگروه نرمال بسته یک گروه به یک فشرده سازی متناظر با فشرده سازی اولیه برای گروه رسید مورد بررسی قرار گرفته و سپس ارتیاط بین ساختارهای مختلف روی این دو فشرده سازی از جمله ایده آل های مینیمال چپ و راست و... مورد بررسی قرا...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.05.016